A note on maximizing a special concave function subject to simultaneous Loewner order constraints
نویسندگان
چکیده
منابع مشابه
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2approximation [14] for this problem. For certain special cases, e.g. max|S|≤k f(S), the greedy algorithm yields a (1− 1/e)-approximation. It is known that this is optimal both in the value oracle model (where the only access to...
متن کاملMaximizing submodular set functions subject to multiple linear constraints
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodul...
متن کاملMaximizing the number of mixed packages subject to variety constraints
We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a pseudo-polynomial procedure to actually implement that optimal solution. The speci"c application is the allocation of excess of a population of various types of cards (e.g., left over from a previous selling season) to "xed-sized &&variety packs'' whic...
متن کاملOn maximizing a monotone k-submodular function subject to a matroid constraint
A k-submodular function is an extension of a submodular function in that its input is given by k disjoint subsets instead of a single subset. For unconstrained nonnegative ksubmodular maximization, Ward and Živný proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata, Tanigawa and Yoshida presenting a 1/2-approximation algorithm. Iwata et al. also pro...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90208-r